Browsing by Subject "Integer programming"

Now showing items 1-16 of 16

    • Article  

      Fault model identification and synthesis in Petri nets 

      Cabasino, M. P.; Giua, A.; Hadjicostis, Christoforos N.; Seatzu, C. (2015)
      Fault identification studies in the Discrete Event Systems literature are typically model-based and require knowledge of the structure of the system, including the nature (and behavior) of the possible faults. In this paper ...
    • Conference Object  

      Gamma Deployment: Designing the Communication Infrastructure in Vehicular Networks Assuring Guarantees on the V2I Inter-Contact Time 

      Silva, C. M.; Guidoni, D. L.; Souza, F. S. H.; Pitangui, C. G.; Sarubbi, J. F. M.; Pitsillides, Andreas (Institute of Electrical and Electronics Engineers Inc., 2017)
      Gamma Deployment is a metric for evaluating the distribution of roadside units in vehicular networks in terms of two parameters: a) the inter-contact time between vehicles and the infrastructure, and, b) the share of ...
    • Article  

      Hodograph-type transformations 

      Sophocleous, Christodoulos (2003)
      We consider second-order evolution equations of the form ut = F1(u,ux)uxx+F2(u,ux) and third order of the form ut = F1(u,ux)u xxx+F2(u,ux,uxx). For each of these equations we construct point transformations which relate ...
    • Article  

      The increase of the instability of networks due to Quasi-Static link capacities 

      Koukopoulos, D.; Mavronicolas, Marios; Spirakis, Paul G. (2007)
      In this work, we study the impact of the dynamic changing of the network link capacities on the stability properties of packet-switched networks. Especially, we consider the Adversarial, Quasi-Static Queuing Theory model, ...
    • Conference Object  

      Integer programs and valid inequalities for planning problems 

      Bockmayr, A.; Dimopoulos, Yannis (Springer Verlag, 2000)
      Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
    • Article  

      Open problems in constructive function theory 

      Baratchart, L.; Martínez-Finkelshtein, A.; Jimenez, D.; Lubinsky, D. S.; Mhaskar, H. N.; Pritsker, I.; Putinar, M.; Stylianopoulos, Nikos S.; Totik, V.; Varju, P.; Xu, Y. (2006)
      A number of open problems on constructive function theory are presented. These were submitted by participants of Constructive Function Theory Tech-04. Copyright © 2006, Kent State University.
    • Conference Object  

      Optimal wavelength allocation and flow assignment in multiwavelength optical networks 

      Kabranov, O.; Makrakis, D.; Charalambous, Charalambos D.; Ionescu, D. (2001)
      Automatically Switched Optical Networks (ASON) require a control strategy that determines the optimal distribution of flows over different wavelengths. Such strategy will increase the profit, by allowing service providers ...
    • Conference Object  

      Performance and stability bounds for dynamic networks 

      Koukopoulos, D.; Mavronicolas, Marios; Spirakis, Paul G. (2004)
      In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (Longest-In-System) and SIS (Shortest-In-System) protocols on specific networks (that can be modelled as Directed Acyclic ...
    • Article  

      Performance and stability bounds for dynamic networks 

      Koukopoulos, D.; Mavronicolas, Marios; Spirakis, Paul G. (2007)
      In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (Longest-In-System) and SIS (Shortest-In-System) protocols on specific networks (that can be modelled as Directed Acyclic ...
    • Article  

      Quantization of FIR Filters Under a Total Integer Cost Constraint 

      Llorens, A. J.; Hadjicostis, Christoforos N.; Ni, H. C. (2005)
      In this paper, we present computationally efficient algorithms for obtaining a particular class of optimal quantized representations of finite-impulse response (FIR) filters. We consider a scenario where each quantization ...
    • Conference Object  

      Selecting Long Atomic Traces for High Coverage 

      Rosner, R.; Moffie, M.; Sazeides, Yiannakis; Ronen, R. (2003)
      This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and novel dynamic selection approaches - ...
    • Article  

      Sensor selection for structural observability in discrete event systems modeled by petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2010)
      This paper studies optimal sensor selection in discrete event systems modeled by partially observed Petri nets. The goal is to place a minimum number of sensors while maintaining structural observability, i.e., the ability ...
    • Conference Object  

      Symbolic schedulability analysis of real-time systems 

      Kwak, Hee-Hwan; Lee, Insup; Philippou, Anna; Choi, Jin-Young; Sokolsky, Oleg (IEEE, 1998)
      We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of ...
    • Article  

      Temporal planning through mixed integer programming: A preliminary report 

      Dimopoulos, Yannis; Gerevini, A. (2002)
      Temporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. This paper presents a ...
    • Article  

      Threshold counters with increments and decrements 

      Busch, Costas; Demetriou, Neophytos; Herlihy, M.; Mavronicolas, Marios (2002)
      A threshold counter is a shared data structure that assumes integer values. It provides two operations: Increment changes the current counter value from v to v+1, while Read returns the value [v/w], where v is the current ...
    • Conference Object  

      Trace processors 

      Rotenberg, Eric; Jacobson, Quinn; Sazeides, Yiannakis; Smith, Jim (IEEE Comp Soc, 1997)
      Traces are dynamic instruction sequences constructed and cached by hardware. A microarchitecture organized around traces is presented as a means for efficiently executing many instructions per cycle. Trace processors exploit ...